Realizing common communication patterns in partitioned optical passive stars (POPS) networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks

We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvious or “natural” method of implementing a communication pattern in the POPS does not efficiently utilize its communication capabilities. We present techniques which distribute the communication load uniformly in the POPS ...

متن کامل

The Partitioned Optical Passive Stars (POPS) topology

This paper presents and analyzes a topological approach to providing multiple data channels using current technologies. The Partitioned Optical Passive Stars (POPS) topology is an all-optical interconnec-tion architecture that uses multiple non-hierarchical couplers. POPS topologies provide powerful conng-urability for optimization of system complexity, network throughput, power budget, and con...

متن کامل

Routing permutations in Partitioned Optical Passive Stars Networks

It is shown that a Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can route any permutation among the n = dg processors in one slot when d = 1 and 2dd=ge slots when d > 1. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations π such that π(i) 6= i, for all i.

متن کامل

Routing Permutations in Partitioned Optical Passive Star Networks

It is shown that a Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can route any permutation among the n = dg processors in one slot when d = 1 and 2⌈d/g⌉ slots when d > 1. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations π such that π(i) = i, for all i.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Computers

سال: 1998

ISSN: 0018-9340

DOI: 10.1109/12.713318